Singular Boolean networks: Semi-tensor product approach
نویسندگان
چکیده
منابع مشابه
A tensor product approach to the abstract partial fourier transforms over semi-direct product groups
In this article, by using a partial on locally compact semi-direct product groups, we present a compatible extension of the Fourier transform. As a consequence, we extend the fundamental theorems of Abelian Fourier transform to non-Abelian case.
متن کاملAnalysis of Boolean Networks Using an Optimized Algorithm of Structure Matrix Based on Semi-tensor Product
The structure matrix based on semi-tensor product can provide formulas for analyzing the characteristics of a Boolean network, such as the number of fixed points, the number of circles of different lengths, transient period for all points to enter the set of attractors and basin of each attractor. However, the conventional method of semi-tensor product gains the structure matrix through complex...
متن کاملa tensor product approach to the abstract partial fourier transforms over semi-direct product groups
in this article, by using a partial on locally compact semi-direct product groups, we present a compatible extension of the fourier transform. as a consequence, we extend the fundamental theorems of abelian fourier transform to non-abelian case.
متن کاملLow storage space for compressive sensing: semi-tensor product approach
Random measurement matrices play a critical role in successful recovery with the compressive sensing (CS) framework. However, due to its randomly generated elements, these matrices require massive amounts of storage space to implement a random matrix in CS applications. To effectively reduce the storage space of the random measurement matrix for CS, we propose a random sampling approach for the...
متن کاملAdaptive Tensor Product Grids for Singular Problems
We consider piecewise polynomial approximation of order M in N-dimensions with a tensor product partition of the space. We assume that the partition is to be chosen to minimize ------'the-maximum----em>r---in-the-approximation.------1be---optimal---Iate---gf--cgrwetgence-foyieGeWisef--------polynomial approximation to a smooth function for unconstrained partitions is known to be order ~/N where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2012
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-012-4666-8